Computational problem - PDFSEARCH.IO - Document Search Engine

Computational problem
Results: 1172

#	Item
361	CCCG 2010, Winnipeg MB, August 9–11, 2010 The traveling salesman problem for lines and rays in the plane Adrian Dumitrescu∗ Abstract Add to Reading List Source URL: cccg.ca Language: English - Date: 2010-07-19 10:46:19 Operations research NP-complete problems Computational complexity theory Travelling salesman problem Approximation algorithm Linear programming Algorithm Polygon Theoretical computer science Mathematics Applied mathematics
362	The min-# problem, a hybrid error criterion for near-linear time performance Lilian Buzer∗† Abstract 2.1 Add to Reading List Source URL: www.cccg.ca Language: English - Date: 2005-07-31 13:55:46 Network theory Shortest path problem NP-complete problems Connectivity Euclidean plane geometry Analysis of algorithms Path decomposition Minimum spanning tree Theoretical computer science Computational complexity theory Mathematics
363	Generation of Eﬃcient Algorithms for Maximum Marking Problems (和訳: 最大マーク付け問題の効率的解法の自動生成) Isao Sasano Add to Reading List Source URL: www.sic.shibaura-it.ac.jp Language: English - Date: 2014-02-04 09:21:05 Operations research Combinatorial optimization Mathematical optimization NP-complete problems Algorithm Mathematical logic Knapsack problem Optimization problem Genetic algorithm Applied mathematics Theoretical computer science Computational complexity theory
364	CCCG 2011, Toronto ON, August 10–12, 2011 Finding Optimal Geodesic Bridges Between Two Simple Polygons Amit M. Bhosle∗ Abstract Add to Reading List Source URL: 2011.cccg.ca Language: English - Date: 2011-08-06 04:11:16 Computational geometry Discrete geometry Euclidean plane geometry Simple polygon Geodesic Vertex Distance Voronoi diagram Art gallery problem Geometry Mathematics Polygons
365	Matrix Computational Assumptions in Multilinear Groups Paz Morillo1 , Carla R`afols2 , and Jorge L. Villar1? 1 2 Add to Reading List Source URL: eprint.iacr.org Language: English - Date: 2015-04-20 07:04:42 Computational hardness assumptions Finite fields Decisional Diffie–Hellman assumption Diffie–Hellman problem Vector space Matrix Kalman filter Principal component analysis Algebra Mathematics Cryptography
366	CCCG 2003, Halifax, Nova Scotia, August 11–13, 2003 Triangle Guarding∗ Jocelyn Smith and William Evans Department of Computer Science, University of British Columbia Add to Reading List Source URL: www.cccg.ca Language: English - Date: 2004-01-08 18:44:35 Computational geometry Euclidean plane geometry Art gallery problem Vertex Convex hull Simple polygon Star polygon Pseudotriangle Geometry Mathematics Polygons
367	ANNALS OF PURE AND APPLIED LOGIC Annals of Pure and Applied Logic276 Fixed-parameter tractability and completeness IV: Add to Reading List Source URL: www.mrfellows.net Language: English - Date: 2009-10-14 09:20:30 Complexity classes NP-complete problems Structural complexity theory Mathematical optimization Parameterized complexity Dominating set P versus NP problem NP-complete Combinatory logic Theoretical computer science Computational complexity theory Applied mathematics
368	CCCG 2011, Toronto ON, August 10–12, 2011 Hardness Results for Two-Dimensional Curvature-Constrained Motion Planning David Kirkpatrick∗ Add to Reading List Source URL: www.cccg.ca Language: English - Date: 2011-08-06 04:11:16 NP-complete problems Network theory Shortest path problem Geodesic Travelling salesman problem Motion planning Trigonometric functions NP Curvature Theoretical computer science Mathematics Computational complexity theory
369	On the Complexity of Immersed Normal Surfaces Benjamin A. Burton∗ ´ Eric Colin de Verdi`ere† Add to Reading List Source URL: www.di.ens.fr Language: English - Date: 2014-02-07 07:27:37 Geometric topology Surfaces Differential topology 3-manifolds Manifold Computational topology Triangulation Normal surface Boolean satisfiability problem Topology Geometry Mathematics
370	Scheduling and SAT Emmanuel Hebrard Toulouse Outline Add to Reading List Source URL: homepages.laas.fr Language: English - Date: 2014-02-17 02:59:42 Constraint programming Logic in computer science NP-complete problems Boolean algebra Boolean satisfiability problem Electronic design automation Satisfiability NP-complete Model checking Theoretical computer science Applied mathematics Computational complexity theory

UPDATE